#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
ll cal(ll n, ll k){
    ll ans = 0;
    int mu = min(n, k);
    int i = 3;
    while(i <= mu){
        ll v = n-1/i;
        if(v < mu) ans += v * ()
    }

    return 2*ans%mod;
}
int main()
{
    //scanf("%d%d", &n, &k);


    return 0;
}
